Scaling limit of random forests with prescribed degree sequences
نویسندگان
چکیده
منابع مشابه
Generation of Random Graphs with Prescribed Degree Sequences
The study of complex networks plays an increasingly important role in science. One common feature of complex networks is that they are large. Probability theory offers a highly effective way to deal with the complexity of networks, and leads us to consider random graphs. Most practical use would require some property constraints on random graphs, usually with given degrees. There are several wa...
متن کاملOn the uniform generation of random graphs with prescribed degree sequences
R. Milo, 2 N. Kashtan, 3 S. Itzkovitz, 2 M. E. J. Newman, and U. Alon 2 Department of Physics of Complex Systems, Weizmann Institute of Science, Rehovot, Israel 76100 Department of Molecular Cell Biology, Weizmann Institute of Science, Rehovot, Israel 76100 Department of Computer Science and Applied Mathematics, Weizmann Institute of Science, Rehovot, Israel 76100 Department of Physics and Cent...
متن کاملConvergence law for hyper-graphs with prescribed degree sequences
We view hyper-graphs as incidence graphs, i.e. bipartite graphs with a set of nodes representing vertices and a set of nodes representing hyper-edges, with two nodes being adjacent if the corresponding vertex belongs to the corresponding hyper-edge. It defines a random hyper-multigraph specified by two distributions, one for the degrees of the vertices, and one for the sizes of the hyper-edges....
متن کاملGenerating simple random graphs with prescribed degree distribution
Let F be a probability distribution with support on the non-negative integers. Four methods for generating a simple undirected graph with (approximate) degree distribution F are described and compared. Two methods are based on the so called configuration model with modifications ensuring a simple graph, one method is an extension of the classical Erdős-Rényi graph where the edge probabilities a...
متن کاملQuasi-random graphs with given degree sequences
It is now known that many properties of the objects in certain combinatorial structures are equivalent, in the sense that any object possessing any of the properties must of necessity possess them all. These properties, termed quasirandom, have been described for a variety of structures such as graphs, hypergraphs, tournaments, Boolean functions, and subsets of Zn, and most recently, sparse gra...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bernoulli
سال: 2019
ISSN: 1350-7265
DOI: 10.3150/18-bej1058